Turing degrees of nonabelian groups

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Turing Degrees of Nonabelian Groups

For a countable structureA, the (Turing) degree spectrum of A is the set of all Turing degrees of its isomorphic copies. If the degree spectrum of A has the least degree d, then we say that d is the (Turing) degree of the isomorphism type of A. So far, degrees of the isomorphism types have been studied for abelian and metabelian groups. Here, we focus on highly nonabelian groups. We show that t...

متن کامل

CLASSIFYING FUZZY SUBGROUPS OF FINITE NONABELIAN GROUPS

In this paper a rst step in classifying the fuzzy subgroups of a nite nonabelian group is made. We develop a general method to count the number of distinct fuzzy subgroups of such groups. Explicit formulas are obtained in the particular case of dihedral groups.

متن کامل

I classes, LR degrees and Turing degrees

We say that A ≤LR B if every B-random set is A-random with respect to Martin-Löf randomness. We study this reducibility and its interactions with the Turing reducibility, Π1 classes, hyperimmunity and other recursion theoretic notions. A natural variant of the Turing reducibility from the point of view of Martin-Löf randomness is the LR reducibility which was introduced in [12]. We say that A ≤...

متن کامل

Turing degrees of multidimensional SFTs

In this paper we are interested in computability aspects of subshifts and in particular Turing degrees of 2-dimensional SFTs (i.e. tilings). To be more precise, we prove that given any Π1 class P of {0, 1} there is a SFT X such that P ×Z is recursively homeomorphic to X \U where U is a computable set of points. As a consequence, if P contains a computable member, P and X have the exact same set...

متن کامل

Randomness, relativization and Turing degrees

We compare various notions of algorithmic randomness. First we consider relativized randomness. A set is ?-random if it is Martin-L?f random relative to 0_1). We show that a set is 2-random if and only if there is a constant c such that infinitely many initial segments x of the set are c-incompressible: C(x) > |x| ? c. The 'only if direction was obtained independently by Joseph Miller. This cha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2007

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-07-08845-4